New heuristic algorithms for the windy rural postman problem

In this paper we deal with the Windy Rural Postman Problem. This problem generalizes several important Arc Routing Problems and has interesting real-life applications. Here, we present several heuristics whose study has lead to the design of a Scatter Search algorithm for the Windy Rural Postman Problem. Extensive computational experiments over different sets of instances, with sizes up to 988 nodes and 3952 edges, are also presented.